Marching cubes: surface complexity measure
نویسنده
چکیده
In this work we give an approach to analyse a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation on the each cube diagonal and there is a possibility to find the coordinates of the three intersections with the diagonal of the approximated surface. In the presented work a common technique for choosing the right subcase from the extended lookup table by using a surface complexity criterion is proposed.
منابع مشابه
Surface Construction Analysis using Marching Cubes
This paper presents an analysis of the algorithms used for generating 3D structures from 2D CT-Scan Datasets. This is achieved by developing an implementation of Marching Cubes, a surface construction algorithm that’s currently the standard used for 3D surface construction in the medical visualization industry.
متن کاملMarching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets
Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...
متن کاملCubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data
In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is based on the marching cubes algorithm, a popular method to convert volumetric data to polygonal meshes. The original marching cubes algorithm suffers from problems of topological inco...
متن کاملOptimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
The aim of this article is to present a reversible and topologically correct construction of a polyhedron from a binary object. The proposed algorithm is based on a Marching Cubes (MC) surface, a digital plane segmentation of the binary object surface and an optimization step to simplify the MC surface using the segmentation information.
متن کاملGeneration of Myocardial Wall Surface Meshes from Segmented MRI
This paper presents a novel method for the generation of myocardial wall surface meshes from segmented 3D MR images, which typically have strongly anisotropic voxels. The method maps a premeshed sphere to the surface of the segmented object. The mapping is defined by the gradient field of the solution of the Laplace equation between the sphere and the surface of the object. The same algorithm i...
متن کامل